A Markov random walk under constraint for discovering overlapping communities in complex networks
نویسندگان
چکیده
منابع مشابه
Markov random walk under constraint for discovering overlapping communities in complex networks
Detection of overlapping communities in complex networks has motivated recent research in the relevant fields. Aiming this problem, we propose a Markov dynamics based algorithm, called UEOC, which means, “unfold and extract overlapping communities”. In UEOC, when identifying each natural community that overlaps, a Markov random walk method combined with a constraint strategy, which is based on ...
متن کاملMarkov Dynamics based on Link-node-link Random Walk to Reveal Link Communities in Complex Networks
Discovery of communities in complex networks is a fundamental data analysis problem with many applications in various domains. Most of the existing approaches have focused on discovering communities of nodes, while recent studies have shown great advantage and utility of the knowledge of communities of links in networks. Aiming to address this new problem, we introduce a stochastic model based ...
متن کاملOverlapping Communities in Complex Networks
1 I hereby declare that I have created this work completely on my own and used no other sources or tools than the ones listed, and that I have marked any citations accordingly. Hiermit versichere ich, dass ich die vorliegende Arbeit selbständig verfasst und keine anderen als die angegebenen Quellen und Hilfsmittel benutzt sowie Zitate kenntlich gemacht habe.
متن کاملDetecting Overlapping Communities in Social Networks using Deep Learning
In network analysis, a community is typically considered of as a group of nodes with a great density of edges among themselves and a low density of edges relative to other network parts. Detecting a community structure is important in any network analysis task, especially for revealing patterns between specified nodes. There is a variety of approaches presented in the literature for overlapping...
متن کاملRandom Networks Growing Under a Diameter Constraint
We study the growth of random networks under a constraint that the diameter, defined as the average shortest path length between all nodes, remains approximately constant. We show that if the graph maintains the form of its degree distribution then that distribution must be approximately scale-free with an exponent between 2 and 3. The diameter constraint can be interpreted as an environmental ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Mechanics: Theory and Experiment
سال: 2011
ISSN: 1742-5468
DOI: 10.1088/1742-5468/2011/05/p05031